A MaxMin approach for hiding frequent itemsets
نویسندگان
چکیده
منابع مشابه
Hiding Sensitive Frequent Itemsets by a Border-Based Approach
Nowadays, sharing data among organizations is often required during the business collaboration. Data mining technology has enabled efficient extraction of knowledge from large databases. This, however, increases risks of disclosing the sensitive knowledge when the database is released to other parties. To address this privacy issue, one may sanitize the original database so that the sensitive k...
متن کاملA New Approach to Mine Frequent Itemsets
Mining frequent patterns in transaction databases and many other kinds of databases has been studied popularly in data mining research. Methods for efficient mining of frequent itemsets have been studied extensively by many researchers. However, the previously proposed methods still encounter some performance bottlenecks when mining databases with different data characteristics. The time requir...
متن کاملA Patricia-Tree Approach for Frequent Closed Itemsets
In this paper, we propose an adaptation of the Patricia-Tree for sparse datasets to generate non redundant rule associations. Using this adaptation, we can generate frequent closed itemsets that are more compact than frequent itemsets used in Apriori approach. This adaptation has been experimented on a set of datasets benchmarks. Keywords—Datamining, Frequent itemsets, Frequent closed itemsets,...
متن کاملFrequent Itemsets Mining: An Efficient Graphical Approach
Recent advances in computer technology in terms of speed, cost, tremendous amount of computing power and decrease data processing time has spurred increased interest in data mining applications to extract useful knowledge from data. Over the last couple of years, data mining technology has been successfully employed to various business domains and scientific areas. Various data mining technique...
متن کاملDiscovery of Frequent Itemsets: Frequent Item Tree-Based Approach
Mining frequent patterns in large transactional databases is a highly researched area in the field of data mining. Existing frequent pattern discovering algorithms suffer from many problems regarding the high memory dependency when mining large amount of data, computational and I/O cost. Additionally, the recursive mining process to mine these structures is also too voracious in memory resource...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data & Knowledge Engineering
سال: 2008
ISSN: 0169-023X
DOI: 10.1016/j.datak.2007.06.012